Oracles for Binary Words
نویسنده
چکیده
The paper proposes a solution to the problem of finding an unspecified binary sequence of known length, using an oracle. Three oracles are defined and used in construction of linear algorithms, with the aim of finding an unknown word α. These algoritms build α by by generating all its prefixes, knowing a specified subword, or using a distance defined on sequences of the same length.
منابع مشابه
Efficient Oracles for Generating Binary Bubble Languages
Given a string α = 10γ in a binary language L, the bubble lower bound is the smallest non-negative integer j such that 1s−10t−j10jγ ∈ L. We present an efficient oracle, which is a function that returns the bubble lower bound, for a number of fixed-density languages including: k-ary Dyck words, connected unit interval graphs, linear-extensions ofB-posets, those lexicographically larger than ω, t...
متن کاملA particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کاملNoise-Tolerant Interactive Learning Using Pairwise Comparisons
We study the problem of interactively learning a binary classifier using noisylabeling and pairwise comparison oracles, where the comparison oracle answerswhich one in the given two instances is more likely to be positive. Learning fromsuch oracles has multiple applications where obtaining direct labels is harder butpairwise comparisons are easier, and the algorithm can leverage...
متن کاملShift-complex sequences
A Martin-Löf random sequence is an infinite binary sequence with the property that every initial segment σ has prefix-free Kolmogorov complexity K(σ) at least |σ| − c, for some constant c ∈ ω. Informally, initial segments of Martin-Löf randoms are highly complex in the sense that they are not compressible by more than a constant number of bits. However, all Martin-Löf randoms necessarily have c...
متن کاملSpace-efficient path-reporting approximate distance oracles
We consider approximate path-reporting distance oracles, distance labeling and labeled routing with extremely low space requirement, for general undirected graphs. For distance oracles, we show how to break the n log n space bound of Thorup and Zwick if approximate paths rather than distances need to be reported. For approximate distance labeling and labeled routing, we break the previously bes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000